On Fault-tolerant and High Performance Replicated Transactional Systems

نویسندگان

  • Sachin Hirve
  • Binoy Ravindran
  • Robert P. Broadwater
  • Roberto Palmieri
  • Eli Tilevich
  • Chao Wang
چکیده

(ABSTRACT) With the recent technological developments in last few decades, there is a notable shift in the way business/consumer transactions are conducted. A majority of transaction now a days fall in Online Transaction Processing (OLTP) category, where transactions are triggered over the internet and transactional systems working in the background ensure that these transactions are processed. One of the most important requirements of these OLTP transaction systems is dependability. Replication is a common technique that makes the services dependable and therefore helps in providing reliability, availability and fault-tolerance. Active replication based replicated transaction systems exploit full replication to avoid service interruption in case of node failures. Deferred Update Replication (DUR) and Deferred Execution Replication (DER) represent the two well known transaction execution models for replicated transactional systems. Under DUR, transactions are executed by clients before a global certification is invoked to resolve conflicts against other transactions running on remote nodes. On the other hand, DER postpones the transaction execution until the agreement on a common order of transaction requests is reached. Both DUR and DER require a distributed ordering layer, which ensures a total order of transactions even in case of faults. In today's distributed transaction processing systems, performance is of paramount importance. Any loss in performance results e.g. latency resulting from slow processing of a client request or slow page load, results in loss of revenue for businesses. Although DUR model perform good when conflicts are rare, it is found to be worst impacted by high conflict work-load profiles. In contrast, immunity from percentage of conflicts within transactions make DER an attractive choice of transaction execution model, but its serial execution results in limited performance and its total order layer for serializing all the transactions results in moderately high latencies. In addition to it, total order layer poses scalability challenges i.e. it does not scale with increase in system size. In this dissertation, we propose multiple innovations and system optimizations to enhance the overall performance of replicated transactional systems. First, in HiperTM we exploit the time between the instance when a client broadcasts its request and the instance when its order is finalized, to speculatively execute the request and commit it when the final order arrives. To achieve this goal, we extend S-Paxos with optimistic delivery, resulting in OS-Paxos and build a transactional system based on DER model. HiperTM uses a novel, speculative concurrency control protocol called SCC, which …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Atomic Updates of Replicated Data

Although several replication strategies have been described and compared in the literature, very few work has been published on the underlying protocols needed to support these strategies. In fact, the classical transactional protocols that are usually assumed are not fault-tolerant, and thus create a window of vulnerability for the \fault-tolerant" strategies they intend to support. In this pa...

متن کامل

HiperTM: High Performance, Fault-Tolerant Transactional Memory

We present HiperTM, a high performance active replication protocol for fault-tolerant distributed transactional memory. The active replication paradigm allows transactions to execute locally, costing them only a single network communication step during transaction execution. Shared objects are replicated across all sites, avoiding remote object accesses. Replica consistency is ensured by a) OS-...

متن کامل

Fault-Tolerant Execution on COTS Multi-core Processors with Hardware Transactional Memory Support

The demand for fault-tolerant execution on high performance computer systems increases due to higher fault rates resulting from smaller structure sizes. As an alternative to hardware-based lockstep solutions, software-based fault-tolerance mechanisms can increase the reliability of multi-core commercial-of-the-shelf (COTS) CPUs while being cheaper and more flexible. This paper proposes a softwa...

متن کامل

Fault-Tolerant Mobile Agents in Distributed Objects Systems

A transactional agent is a mobile agent which manipulates objects in one or more than one object server so as to satisfy some constraints. There are some types of constraints depending on applications. ACID is one of the constraints, which shows traditional atomic transactions. There are other constraints like at-least-one constraint where a transaction can commit if at least one object server ...

متن کامل

SHAFT: Serializable, Highly Available and Fault Tolerant Concurrency Control in the Cloud

Guaranteeing transaction semantics in a highly available and fault tolerant manner is desirable to application developers. Besides, it is a very valuable feature for database-backed applications. SHAFT is a pessimistic concurrency control protocol for partitioned and replicated data, which can be distributed across multiple datacenters. Laying its basis on the Paxos algorithm, the SHAFT protoco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014